A Note on \ a Dual - Ascent Approach to Thefixed - Charge Capacitated Network
نویسنده
چکیده
We show by a counterexample that the dual-ascent procedure proposed by Herrmann, Ioannou, Minis and Proth in a 1996 issue of the European Journal of Operational Research is incorrect in the sense that it does not generate a valid lower bound to the optimal value of xed-charge capacitated network design problems. We provide a correct dual-ascent procedure based on the same ideas and we give an interpretation of it in terms of a simple Lagrangean relaxation. However, we show that, although correct, this procedure is not e ective, as in general, it provides a less tighter bound than the linear programming relaxation.
منابع مشابه
ACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملA Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
The fixed-charge network design problem arises in a variety of problem contexts including transportation, communication, and production scheduling. We develop a family of dual ascent algorithms for this problem. This approach generalizes known ascent procedures for solving shortest path, plant location, Steiner network and directed spanning tree problems. Our computational results for several c...
متن کاملCapacitated Multimodal Structure of a Green Supply Chain Network Considering Multiple Objectives
In this paper, a supply chain network design problem is explained which contains environmental concerns in arcs and nodes of network. It is assumed that there are some routes such as road, rail and etc. in each pair of nodes. In this model decision variables are choosing facilities to open, environmental investment level in each facility and flow of products between nodes in each route. A multi...
متن کاملA Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem
We present a simple dual ascent method for the multilevel facility location problem which finds a solution within 6 times the optimum for the uncapacitated case and within 12 times the optimum for the capacitated one. The algorithm is deterministic and based on the primal-dual technique.
متن کاملModeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch (TECHNICAL NOTE)
The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...
متن کامل